Method for a high speed communication system

ABSTRACT

Methods and devices useful in high-speed scalable switching systems include a memoryless switch fabric, per virtual channel queuing, digital phase aligners, randomized and complement connection modes, a mid-point negative acknowledge and output negative acknowledge scheme among other elements. A particular implementation of a routing table and switch element is described in part to illustrate the various techniques and devices of the invention.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority from provisional patent application No.60/033,029 (hereinafter the '029 application) filed Dec. 12, 1996incorporated herein by reference, and is a division of application Ser.No. 08/988,940, filed Dec. 11, 1997, now U.S. Pat. No. 6,188,690. The'029 application includes early data sheets and documentation forspecific embodiments of the invention and of related inventionsseparately described and claimed in related patent co-assigned patentapplications MANY DIMENSIONAL CONGESTION DETECTION SYSTEM AND METHOD,filed Nov. 14, 1997, and METHOD AND APPARATUS FOR DETECTING DISABLEDPHYSICAL DEVICES AND DELETING UNDELIVERABLE CELLS, filed Nov. 7, 1997.

This application describes improved methods and apparatus for digitalcommunication. Earlier related methods and apparatus are discussed inco-assigned U.S. Pat. No. 5,583,861, filed Apr. 28, 1994, and alldivisionals and continuations based thereon including: U.S. patentapplication Ser. No. 08/680,869, filed Jul. 16, 1996. Collectively, the'861 patent and its divisionals are referred to herein as the '861patents and are incorporated herein by reference for all purposes.

Other related discussion may be found in co-assigned patent applicationASYNCHRONOUS BIT-TABLE CALENDAR FOR ATM SWITCH, which is a continuationof Ser. No. 08/616,875, filed Mar. 15, 1996.

MICROFICHE APPENDIX AND COPYRIGHT NOTICE

A microfiche appendix including 258 frames on three fiche is includedherewith. This appendix includes user manuals for two specificintegrated circuit devices that incorporate aspects of the invention. Aportion of the disclosure of this patent document contains material thatis subject to copyright protection. The copyright owner has no objectionto the facsimile reproduction by anyone of the patent document or thepatent disclosure as it appears in the Patent and Trademark Officepatent file or records, but otherwise reserves all copyright rightswhatsoever.

This application is further being filed with two paper appendices.Appendix A includes a description of a specific phase aligner utilizingaspects of the invention. Appendix B includes a technical presentationdiscussing a randomization mode and other aspects of the invention.

FIELD OF THE INVENTION

This invention relates to electronic circuits. More specifically, theinvention relates to electronic systems used for digital communications.In specific embodiments, the invention relates to improved methods andsystems for routing digital communication data in a paradigm known asAsynchronous Transfer Mode (ATM); however, the invention in some aspectshas wide-ranging applications in a number of other data communicationsenvironments, and therefore the invention should not be seen as limitedexcept as provided in the attached claims.

BACKGROUND OF THE INVENTION

This invention relates generally to a class of digital communicationsystems known as asynchronous transfer mode (ATM) switching systems andgenerally to intercomputer communications and telephony architectures.Although the invention is described herein with reference to specifichardware and software implementations for the purposes of providing aclearer explanation of the invention, it will be apparent to one ofordinary skill in the art that the inventions as described in theattached claims will have application in a variety of differentcommunication environments. An extensive background discussion of ATMtechnology may be found in the '861 patents and other related patentscited herein.

Increasing demands for communications speed and capacity have created aneed for higher performance ATM architectures that are highly scalableand can effectively handle large amounts of multicast and unicasttraffic. An increasing variety of communications applications hascreated a need for ATM components that can be used in a wide variety ofdifferent ATM board designs. What is needed are methods and devices forconstructing flexible and high performance digital switching systems.

SUMMARY OF THE INVENTION

The present invention in various aspects concerns apparatus and methodsfor use in communication technology. More specifically, the invention isinvolved with improvements useful in ATM communications. As is known inthe art, many ATM systems are constructed of devices known as switchelement (SEs) and routing table (RTs) and may include additionaldevices. The invention will be described in terms of the operation ofSEs and RTs, but aspects of the invention have applications outside ofthese particular devices and the invention should not be seen as limitedexcept as indicated in the attached claims. For the sake ofcompleteness, specific implementations of an SE and an RT are describedin detail. In a specific implementation, a circuit which has athroughput four times greater than a previous generation RTs is referredto as a Quad RT (QRT™); and a switch element having 32 input ports and32 output ports is referred to as a Quad SE (QSE™). It should beunderstood, however, that aspects of the invention do not depend on thespecific QSE and QRT implementation and may be implemented incommunication systems with different architectures. Just a few examplesof these include systems wherein each RT is a separate IC device orwherein different numbers of RTs are combined into one IC, or whereinSEs are placed in ICs with more or fewer than 32 input or output ports.Some aspects of the invention will also apply to data systems other thanATM systems and other than systems employing SEs or QRTs as will be seenfrom the claims. The present invention should therefore be seen as notlimited except as indicated by the attached claims including allallowable equivalents.

In particular embodiments, the present invention concerns a newarchitecture for ATM SEs and RTs. In this new architecture, a memorylessswitch fabric architecture is used allowing for alternate pathselection. In a specific embodiment, this memoryless mode is used forunicast traffic and a distributed memory mode, such as described in the'861 patents, is used when handling multicast traffic. In oneembodiment, an SE in accordance with the invention determines a bestpath for its multicast traffic and separately determines a best path forits unicast traffic and then a multicastlunicast arbitrator arbitratesbetween the two solutions to determine which traffic actually flowsthrough the SE.

In one embodiment of the invention, an initial stage device, hereinreferred to as an RT, uses per virtual channel (VC) queuing of receivebuffers to eliminate the well-known head-of-line blocking common inother ATM architectures. A switch fabric further, according to theinvention, is able to deliver a per VC ACK/NACK signal to preventblocking. In an embodiment, furthermore, the switch fabric delivers anMNACK signal letting an RT know whether a blocking condition occurredwithin the fabric, which is likely not to be present during a next cellcycle, or at the output of the fabric (ONACK), which signals to the RTto not attempt an immediate retransmission.

In unicast mode, an SE according to the present invention performs veryfast routing determination for an incoming cell based on the firstnibbles in the cell. In each SE, the first several nibbles of a routingheader are read and removed from the beginning of the cell header, usedto determine a route through the SE, and then appended to the end of therouting header of the cell. Appending the nibbles to the end of therouting header facilitates handling of cells by allowing cells to remainthe same length, preserving parity, and speeding routing of the cells bya next stage switch element.

In a further aspect of the invention, SE inputs contain an elasticbuffer on each input to allow cells travelling from different distancesto be delayed in their arrival time into the SE processing so that cellson all inputs will enter into the SE routing processing at the same timeto allow for effective routing and arbitration.

According to the present invention, SE outputs may be aggregated organged when multiple outputs are travelling into the same SE in a nextstage. In specific embodiments, gangs of 1, 2, 4, 8, 16 or 32 arepossible and can be effectively handled by a QSE in unicast mode.Ganging outputs reduces the number of dropped cells in an SE whencontention occurs for SE outputs by making those outputs wider.

According to the invention, as discussed above, a specific embodiment ofan SE is referred to as a QSE (Quad Switch Element). A particular QSEhas 32 nibble-wide (4 bit) inputs and each input includes anacknowledge/backpressure line and a start of cell line, adding up to 6bit-lines per input. A specific embodiment of a QSE is designed to beused in switch fabrics of up to 64 rows and five columns. In oneembodiment, during a single cell cycle, a unicast cell either makes itall the way through the stages of QSEs in the switch fabric to an ORT orit does not and is dropped by the fabric. Cells that are dropped in thefabric are either not acknowledged or are negatively acknowledged backto an IRT and must be resent by the IRT. In one embodiment, a negativeacknowledgement for a unicast cell is received by the IRT before thebeginning of a next cell cycle, so that an IRT can choose to resend thecell in the immediate next cell cycle. In one embodiment, a mid-switchnegative aclmowledgement (MNACK) indicates if a cell is dropped within aswitch fabric prior to a deterministic routing point so that the IRTwill know if it should immediately resend the cell. A switch fabricoutput negative acknowledgement (ONACK) indicates if a cell is droppedat a fabric output so that the IRT will know if it should send adifferent VC's cell.

In a further aspect, a new architecture according to the inventionprovides for a number of virtual outputs (VOs) for each physical outputfrom an ORT and virtual inputs (VIs) for each physical input to an IRT.A congestion detection system may be deployed in the architecture asdescribed in patents incorporated above. A system for detecting disabledphysical devices and deleting undeliverable cells may be deployed-in thearchitecture as described in patents incorporated above.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a representation of an ATM network 10 as an example of anATM architecture using ATM elements including aspects of the invention.

FIG. 2 shows an example of an IRT 120 and ORT 170 in which the inventioncan be employed.

FIG. 3 is a block diagram showing the basic routing and arbitration ofdata in a switch element according to an embodiment of the invention.

FIG. 4 shows a QSE interface block diagram.

FIG. 5 shows various switching devices that can be constructed with QSEsand QRTs according to the invention.

FIG. 6 shows a QRT System Overview.

FIG. 7 shows a system diagram of internal QRT blocks and externalinterfaces.

FIG. 8 shows basic data and signal paths between QRTs and arepresentative portion of QSEs.

FIG. 9 shows a QSE 488 pinout block diagram.

FIG. 10 illustrates the operation of the various receive channel ring.

DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS 1. Functional Block Diagramof an ATM System

FIG. 1 shows a representation of an ATM network 10 as an example of anATM architecture using ATM elements including aspects of the invention.ATM network 10 as illustrated contains input transmission line 110,input routing tables (IRTs) 120, a N×N switch matrix 150, output routingtables (ORTs) 170, and output transmission lines 180. Associated withIRT 120 is cell buffer memory 122 and configuration memory 124.Associated with ORT 170 is cell buffer memory 172 and configurationmemory 174.

ATM cells, which are digitized packets corresponding to a voice or videosignal or a data stream, are sent through an input transmission line 110into a connecting IRT 120. The IRT 120 ascertains the cell's routing anddetermines an entry point into the switch matrix path, based on aparticular algorithm, including a random-entry algorithm.

Cells are arranged in queues within a buffer memory 122 associated withIRT 120 and are then transmitted through the switch matrix 150. Uponexiting the switch matrix, a cells is sent to one (or possibly more thanone in the case of multicast cells) of the N ORTs corresponding to thecell's destination address. Within the ORT 170, received cells arequeued in a plurality of queues in cell buffer 172 and subsequentlytransmitted onto a connecting output transmission line 180. In thismanner, an ATM network can route audio, video or data signals, eachrequiring different bandwidth and transmission speeds.

In order to manage cells flowing through an ATM network, cells aregrouped within the RTs into virtual channels (VCs). A VC can be thoughtof as a sequential stream of cells flowing from a source to adestination, generally representing a single connection such as a singletelephone call. The channel is referred to as a virtual channel becausethere is not generally a dedicated path within the ATM switch from thesource to the destination; the actual path may vary from transmission totransmission, or even during transmission, depending upon the type oftraffic sent, whether congestion occurs, or other factors.

In the specific embodiment shown, each input transmission line can carrycells from a plurality of virtual inputs (VIs), which number 31 in aspecific embodiment. A specific embodiment of an ATM RT can keep trackof 16K VCs and a particular VC can occur on any VI. At its simplest, aVC is a stream of cells travelling from a particular VI to a particularVO and having a particular transmission priority. In many ATM switches,cells or VCs are assigned a service class (SC) (sometimes referred to asa priority). The SC defines certain handling within the ATM switch, suchas priority of throughput or the amount of available bandwidth that aparticular VC is allowed to occupy.

In advanced-ATM networks, cells may also be grouped according to VOs.Supporting VOs allows the cell to be routed to different physicalreceivers out of the same ORT output line, with data multiplexed to thedifferent output receivers by a device outside of the ORT.

FIG. 1 may be understood to represent a switch constructed of very basicATM devices or it may be understood to represent various operationalblocks of more highly integrated ATM components such as the QSE and QRTdescribed herein.

2. Variety of Configurations of Switch Fabrics

In one embodiment of the invention, SEs are constructed to have 32 inputports and 32 output ports and are referred to as QSEs. QSEs according tothe invention can be assembled into switch fabrics with a variety ofconfigurations. One configuration of a switch fabric is made up of 20QSEs, arranged in four rows and five columns. As will be explainedbelow, a QSE according to the invention may gang its output ports. EachQSE shown is configured in two gangs of 16 output ports each and canroute cells to one of two QSEs in a next stage. Note that the switchfabric in FIG. 2 provides one-way connection between 256 inputs and 256outputs. In order to route cells in the other directions, a second setof 20 QSEs would be needed.

While a variety of types of switch fabric interconnections are known inthe art, in one embodiment unicast cells placed into a switch fabric arenot explicitly routed for the first half of the fabric. Cells areinstead randomized or otherwise delivered in a non-addressed manneruntil the middle stage of the fabric is reached. At that point, infabric designs under discussion, routing through the latter half of thefabric will occur under the same addressing regardless of which SE acell winds up in the mid-point of the fabric. One specific QSE islimited to a fabric with a maximum of five columns (or stages) and 64rows, resulting in a switch fabric with 2048 (2K) ATM input lines.

3. Detailed Description of RT

FIG. 2 shows an example of an IRT 120 and ORT 170 in which the inventioncan be employed A configuration data structure for each VC according toone embodiment is stored in memory 124, which, because of the sizenecessary to store data structures for 16K virtual channels, may belocated in external memory. Data structures are also maintained for eachSC, VO, and SCQ. In one embodiment, these data structures are maintainedin internal memory 125 and 175, as shown, in order to be more quicklyaccessible.

According to one embodiment, each cell counter may be constructed as aseparate arithmetic/logic unit (ALU) for independently incrementing ordecrementing its count value and independently comparing that value toloaded thresholds so as to speed processing of a cell. FIG. 4 shows oneexample of details of an ALU and is described in more detail below. Itshould be understood that depending on overall configuration, countvalues may remain in an ALU for extended period and not need to beloaded from memory. Count values for a device, for example, might remainalways loaded in their respective ALU. Alternatively, count values couldbe loaded into a register and incremented and compared by a centralprocessing unit.

4. Detailed Description of SE

FIG. 3 is a block diagram showing the basic routing and arbitration ofdata in a switch element according to an embodiment of the invention.One advance of the invention is that cells may be routed from one end ofthe switch fabric to the other end in a single cell time and are notqueued anywhere in the switch fabric. This feature, when combined withother features described herein, allows for flexible and efficienthandling of cell traffic. While this feature could be used to handle allcell traffic according to the invention, including multicast traffic(MC), in a specific particular embodiment buffer memory associated withindividual SEs is used when handling multicast (MC) traffic. This isdone in part due to certain limitations in circuitry and processing. MCtraffic is stored in an SE buffer for at least one cell cycle before itis forwarded, similar in several respects to MC cell routing asdescribed in the '861 patents. Thus, in one embodiment, the newarchitecture combines a memoryless operation mode for handling unicasttraffic with a memoried mode for handling and multicast traffic. In oneembodiment, an SE in accordance with the invention determines a bestpath for its multicast traffic and separately determines a best path forits unicast traffic. A multicast/unicast arbitrator then arbitratesbetween the two solutions to determine which cell flows out of aparticular output port of the SE.

4.1. SE Elastic Input Buffer

In a further aspect of the invention, SE inputs contain an elasticbuffer on each input to allow cells travelling from different distancesto be delayed in their arrival time into the SE processing. This allowscells on all inputs will enter into the SE routing processing at thesame time to allow for effective routing and arbitration.

4.2. Ganging of SE Outputs

According to the present invention, SE outputs may be aggregated organged when multiple outputs are travelling into the same SE in a nextstage. In specific embodiments, gangs of 1, 2, 4, 8, 16 or 32 arepossible in unicast modes and gangs of 1, 2, or 4 are possible inmulticast mode. In a specific embodiment, unicast and multicast gangingneed not be the same. Ganging outputs reduces the number of droppedcells in an SE when contention occurs for SE outputs by making thoseoutputs wider. In one embodiment, as described below, routing in an SEtakes place more quickly in proportion to how much the outputs areganged.

4.3. OSE division 16/16 mode

In a further embodiment, a 32-input-QSE according to the invention, maybe configured to operate as two 16-port-SEs. This configuration allowsone-half of the QSE to carry traffic in a forward direction and theother half to carry traffic in a reverse direction. In thisconfiguration, a single QSE chip may be coupled with four QRTs to make a16×16 switch.

4.4. Operation of Switch Element

The basic operation of an SE in accordance with the present inventionmay be understood as comprising the steps of: receiving cells on inputports, determining a routing for cells to output ports, arbitratingwhich cells will actually be transmitted out of given output ports,transmitting those cells out of output ports, and sendingbackpressure/acknowledge signals in a reverse direction back to inputports. In one embodiment of the present invention, these steps areperformed differently and for the most part independently for unicastand multicast cells, with arbitration between unicast and multicastcells taking place at the final arbitration step.

FIG. 3 illustrates the basic path for these steps. Cells are received byphase aligners and elastic buffer 202. Unicast cells are sent to aunicast routing path 210, multicast cells are sent for routing tomulticast path 220, arbiter 230 determines which cells will be output bydata drivers 290. In the reverse direction, a BP₁₃ ACK signal istransmitted back through arbiter 230 to the correct input port throughdrivers 295.

4.4.1 Memoryless Cell Receiving

In memoryless mode, an SE according to the present invention performsvery fast routing determination for an incoming cell based on the firstdata portion of the cell. The first portion of the cell includes arouting tag that is appended to the cell by the IRT. In each SE in thefabric, the first several fields (or nibbles) of a routing header areread and removed from the beginning of the cell header, are used todetermine a route through the SE, and then appended to the end of therouting header of the cell. Appending the nibbles to the end of therouting header facilitates handling of cells through the switch fabricby allowing cells to remain the same length, preserving parity, andspeeding routing of the cells by a next stage switch element Some priorart ATM switches deleted the first parts of the routing tag after thetag was used by the SE. According to one embodiment, each stage of SEsin a fabric modify the routing header as it is passing through thatstage. In this way, as a cell is being received by an SE, that SE isimmediately able to begin routing the cell based on the first fewnibbles of header.

In one embodiment, a Routing Tag added by an IRT specifies the routingpath from the middle of the switch fabric to the end. The QSEs randomlydistribute UC cells in the stages before the middle stage. The QRT knowsthe size of the switch fabric and each SE in the fabric knows whether itis randomizing or not.

4.4.2 Memoryless Routing and Arbitration

According to the present invention, in a given cell cycle, an SEreceives a number of unicast cells on its input ports and mustdetermine, in that cell cycle, which output ports those cells will beconnected to and which cells will be dropped. In one embodiment, an SEhas 32 input ports and can receive and forward up to 32 unicast cells.

For each cell entering the SE, an output gang for that cell is eitherspecified in the cell header appended by the IRT or the SE assigns thegang randomly. Within each output gang, the SE then sorts the UC in topdown order on a priority basis with the highest priority in highestnumbered output port of the gang. The UC arbitration is then complete.

In a specific embodiment QSE sorting is done in parallel and for everygang there is a selector network, which is a hardware logic circuit forthe gang. The selector network for a gang chooses the input ports thatwant to go to that gang based on priority. Routing is therefore done inparallel. In one embodiment, a QSE has only four separate selectornetworks, and if more than four gangs are defined, the networks are usedin pipeline fashion until all gangs are processed. In the case where twocells for a selector network have exactly the same tag, the SE randomlychooses between them by placing random bits in a lower order portion ofthe tag.

In an SE according to the present invention, routing and arbitrationtake place during the first several clock cycles of a cell cycle.Therefore, the beginning of a cell is played out of an SE output portwhile the middle and end of the cell is still being played into the SE.The current invention includes very fast routing techniques to reducethe latency through a QSE and routing is designed to use the minimumnumber of clock cycles. The routing algorithm according to the presentinvention runs in less time if there are less bits in the routing tag sothat a gang(8) runs more quickly than a gang(4). In one embodiment,cells emerge from an SE as follows: for gang(1)=13 clocks; Gang(2)=10clocks; Gang(4)=8 clocks from when a cell exits the elastic store untilcells are played out of the SE.

4.4.3 Multicast Cell Receiving and Storae into MC Buffers.

In the present invention, the receiving of MC cells and assignment ofthose cells to cell buffers and the control of cells in cell buffers arehandled, in the most basic sense, similarly to as described in the '861patents. MC cell buffers are dynamically allocated to incoming multicastcells by a multicast queue engine and wherein each MC cell remains in abuffer until it can be sent out of all outputs to which it should berouted. In one embodiment, however, a QSE can store up to 64 MC cellsand can route cells in accordance with several different gangdefinitions and with three priorities over the 32 output ports. MC cellbuffers within an SE may be segregated according to priority.

Each MC cell buffer has associated with in an MC group vector indicatingto which output ports the cell has yet to be routed, largely asdescribed in the '861 patent.

4.4.4 Multicast Routing and Arbitration

For multicast routing, during one cell cycle, the SE must choose whichof up to 64 stored MC cells to connect to output ports. This task iscomplicated by two factors. First is that each of the 64 buffered MCcells may connect to multiple output ports and second is that MC cellsmust be output according to both the priority of the cells and accordingto which cell has been stored the longest. The invention accomplishesboth these task in a method that quickly chooses the best MC cells andthat also facilitates picking between MC and UC cells in the finalarbitration stage.

4.4.4.1. Multicast Timestamp (TS)

According to the invention, each MC cell receives a timestamp when it isplaced in the MC buffer. The TS mechanism allows the MC arbitrationalgorithm to simultaneously accomplishes the goals of keeping cells inFIFO order and allowing multipriority multicast.

The purpose of assigning a TS is to determine which stored cell isoldest. One straightforward way to do this would be to simply record anabsolute time when each cell is stored in a buffer and compare that to aclock. However, because there is no definite limit to the amount of timea particular MC cell remains in the MC buffer it is uncertain how manybits would need to be stored to keep stored cells properly in order.

An SE according to the invention solves this problem recognizing thatall that is required for correct routing of MC cells is that the SE canalways identify different ages of cell buffers in relation to oneanother. In a specific embodiment, with 64 cell buffers, a TS of sixbits ensures that MC cells can always be sent out in proper order evenwhen there is a different arrival time for each stored buffer.

In a specific embodiment, whenever one or more MC cells are placed intothe MC buffer, they will be assigned a TS of zero (000000). The SEexamines all pre-existing TSs starting from the newest possible time(000000) until it finds a TS that is not used. At that point all TSvalues below that number are incremented by one, which always assuresthat any prior cells with TS of 0 have their TS promoted to 1 andtherefore TS 0 is free to be assigned to all new incoming MC cells. In aspecific embodiment, all the TS from the cell buffers are given to asorter and the sorter looks for the first non-used number between 0 and63 and returns that number, which is broadcast to an engine/ALUassociated with each MC buffer. The MC buffer engine compares thatbroadcast TS with its own TS and increments its TS by one if its TS islower than the broadcast TS.

4.4.4.2. Multicast TAG

The SE uses the TS and the priority to build a MC tag for each of thecells in the buffer. In one specific embodiment, the first two bits ofthe MC tag represent the priority, the next six bits are the TS, and thenext one or two or three or four bits are the lowest one or two or threeor four bits of the port number which is used to indicate which line ofthe gang the MC cell came in on. These final bits are necessary becauseeach QSE independently keeps MC cells in FIFO order based on the portthat the MC cell arrived on. Once the SE has constructed an appropriateMC tag for each buffer, the output gangs are determined that the MC cellwith the highest tag for each output gang is selected. The highestnumbered MC tag takes into account the priority, the TS and the gang.This further provides flexibility because changing the output schemewould only require a rearrangement of bits in the MC tag. The inventionthus provides an efficient algorithm to solve a difficult cellscheduling problem and allows the SE to choose MC cells for all outputports in parallel at the same time. Prior art SE implementations used aslower, iterative approach where cells were picked on an output port byoutput port basis.

It will be seen from the above that an SE treats the priority as if itwas the most significant bits of the time. The SE can then take theeffectively “oldest” cell first and at once send out the highestpriority cells and the oldest cells per priority.

As in some prior art SE implementations, the SE of the current inventiondoes not keep track of VCs and only keeps track of cell priorities. Inone embodiment, an SE establishes three priorities for both MC and UCcells, and these priorities are mapped by the IRT to the different SCs.The present invention provides improved MC routing to allow an SE tohandle more than one MC priority and to perform multi-priority MC in adistributed memory system switch fabric with an algorithm that ran fastenough for a 32×32 port SE. Multicast routing is further complicated bythe fact that a particular MC cell may be routed out of multiple gangs,as defined by the MG variable. The establishment of MC groups is done ina similar way to prior art implementations.

4.5. Arbitration between Unicast (UC) and multicast (MC)

As described above, the SE determines its best choice of connections for32 input ports to 32 output ports based on the tag of each cell. Thesecells are then sorted in top down order within a gang on a tag(priority) basis with the highest priority in highest numbered outputport of the gang. For every gang there is a selector network, which isgiven as its input the priority tag of the cells that want to go of thatgang. The selector network over all inputs that want to go to that gangthen chooses the cells that make it.

The MC arbiter then does the same, but with the highest priority celltags placed in the lowest numbered output port of the gang.

The final arbiter then looks at every port individually within a gangand picks the highest priority between the MC cell and the UC cell. (Inone embodiment, there are three priorities for UC and three for MC.) Inone embodiment, the final arbiter need only look at the two highestpriority bits because other priority has already been sorted out atearlier stages. An MC tag includes the priority cell of the cell, the TSof the buffer, and which input port within a gang that the cell enteredthe switch element on. By combining all these elements into a single tagand performing the arbitration as just described, MC cells will alwaysbe selected for transmission first based on priority, then on age, thenin the correct order that they entered the SE.

At the end of the arbitration process, cells that won the arbitrationfor each port are sent of those output ports. Information about cellsthat did not win is sent back to the MC buffer controllers and the ACKengine respectively.

5. Backpressure and Acknowledge

In one embodiment of unicast routing, an acknowledge signal (ACK) or anegative acknowledge signal (NACK) is delivered back to the IRT on a perVC basis for each data cell that is transmitted into the switch fabric.In a further embodiment, this ACK signal is delivered before thebeginning of the next cell cycle to the same port on which the cellbeing acknowledged was being transmitted so that the cell's VC can beidentified and a cell can be retransmitted in the immediate next cellcycle if the acknowledge was due to a blockage within the middle of thefabric that is likely to not exist during the next cycle..

In one embodiment of multicast routing, there is no ACK/NACK signal sentback to the IRT because a cell may be stored within the switch fabricand delivered in a later cell cycle. A multicast embodiment, however,uses a backpressure (BP) feedback signal to upstream SEs and the IRT tolet the IRT know that a particular path is experiencing congestion sothat a sender will not send certain cells that will cause congestion.

In one embodiment, the same physical line is used for BP and for ACK andthere is one physical line per port. The signals are interpreted as ACKsignals when unicast traffic has been sent by the IRT and as BP signalswhen multicast traffic is being sent. Both BP and ACK messages can besent in a cell time and are distinguished by the value of a field. Dataon the line is sent is serial fashion and several bits make up the BP orACK packets. In a particular QSE embodiment, there are 32 of thesesignal lines, referred to as BP_ACK_OUT(31:0).

6. Specific Implement Of A SWITCH ELEMENT, the WAC-488

Aspects of the present invention are incorporated in the WAC-488, aspecific switch element part developed by the assignee of the presentinvention. Details of this implementation are included herein for thesake of completeness and to provide additional disclosure, but shouldnot be taken as limiting the invention. The 488 implements a singleelement of a scalable switch fabric. The 488 has 32 input and 32 outputports, each containing a nibble-wide data interface, a start-of-cellsignal, and a backpressure/acknowledge signal. Groups of 1, 2, 4, 8, 16,or 32 ports can be configured to act as a single aggregate port forunicast traffic. For multicast traffic, inputs and outputs can begrouped together in groups of 1, 2, or 4 ports. The input multicastgrouping and output multicast grouping mode need not be the same. The488 can also be configured as a single 32 input×32 output switch, or astwo independent 16 input×16 output switches.

The flow of cells through the 488 can be broken into two separate datapaths, one for unicast cells, and the other for multicast cells. Unicastcells are routed from one end of the switch fabric to the other end in asingle cell time. In other words, no unicast cells are ever stored inthe switch fabric, only in the routing tables at the ingress and egressof the fabric. Multicast cells are routed in a store-and-forward method.Each 488 can store up to 64 multicast cells.

The unicast cell flow contains a distribution stage that can be used todistribute the routing of cells to outputs. The multicast cell flowcontains an interface to an external SRAM that contains the MulticastPort Vector (MPV) information for routing cells to multiple outputs.

Phase aligners aid in the construction of large systems, since clockinformation is recovered from the data sent to each 488 switch fabricport. As a result, there is no setup or hold time requirements on thesesignals, and the overall clock distribution scheme within the system canbe simplified. However, overall system jitter and skew between signalson the same switch fabric data port still has to be managed. Phasealigners are used on the BP_ACK_IN(31:0), SE_SOC_IN(31:0), andSE_DATA_IN(31:0, 3:0) signal lines. A variety of types of phase alignersas are known in the art may be used with the invention.

Another aid to the construction of large systems is an elastic store ateach 488 input data port. The data elastic store allows data arrivingfrom different ports to be offset from each other by up to a limit of 8clock cycles. The internally generated and software programmable localCELL_START signal marks the end of an 8 clock-period window within whichthe Start-Of-Cell (SOC) marker on each of the SE_SOC_IN(31:0) lines mustarrive.

6.1. Memoryless Cell Flow

Each of the 32 nibble-wide inputs is connected to an output by acrossbar. This crossbar is transparently controlled by the cell'srouting tag, which specifies an input-to-output connection. In the eventof a conflict for an output port, higher priority cells are givenpreference over lower priority cells. In distribution mode, incomingunicast cells are routed to outputs using a congestion technologydescribed in a related application

Depending on the gang mode, the 488 will need a certain number ofrouting bits to determine the output gang of a unicast cell (forexample, in a gang 4, there are 8 output gangs, thus 3 routing bits arerequired by the 488; in distribution mode, no routing bits are needed).These bits are taken from the head of the routing tags TAG_0 throughTAG_7 and then replaced at the tail.

6.2. Memoried Cell Flow

There are 64 internal cell buffers for multicast traffic that are sharedbetween three multicast priorities: high, medium, and low. The 32 cellbuffers are pooled for each group of 16 input ports. These cell buffersare dynamically allocated to incoming multicast cells by a multicastqueue engine. Each cell is buffered until it can be sent out on alloutput ports to which it should be routed. These output ports aredesignated by a Multicast Group Vector (MGV) that is associated witheach multicast cell.

When a multicast cell is received, its MGV is fetched from RAM andcopied to the MULTICAST_QUEUE_COMPLETION register. TheMULTICAST_QUEUE_COMPLETION register keeps track of which ports the cellneeds to be sent to before its cell buffer can be cleared. The 488 has128 MGV entries in internal SRAM, and support for up to 32K entries ifan external SRAM is provided.

A higher priority multicast or unicast cell will preempt a lowerpriority multicast cell destined to the same output port. The preemptedmulticast cell will have to wait until the following cell time foranother opportunity to send a cell to the output port.

6.3. Arbiter

The arbiter arbitrates between unicast cells and multicast cellscontending for the same output port. Higher priority cells are givenpreference over lower priority cells. If a multicast cell and unicastcell have the same priority, one cell is randomly chosen. The randomchoice can be biased in favor of unicast cells or of multicast cells byusing the UC/MC FAIRNESS REGISTER. This is necessary in multiple-stageswitch fabrics since unicast cells are routed in a cut-through fashionand multicast cells are routed in a store-and-forward fashion. Forexample, consider a congested 3-stage fabric where unicast cells andmulticast cells of equal priorities collide at each stage in the fabric.A unicast cell must make it from ingress to egress in one cell time. Itschances of doing this would be (½)³=⅛. However, each multicast cellwould have a ½ chance of advancing to the next stage in the fabric. Thefairness register is used to bias the selection of unicast cells atdifferent points in the fabric so unicast cells are favored at laterstages in the fabric.

6.4. Backpressure and Acknowledge

The BP_ACK_OUT(31:0) lines are used to send information from a 488 toupstream 488s or QRTs. This line is used to send two kinds ofinformation, one for unicast and one for multicast.

For multicast cells, backpressure information is sent. This tells anupstream QRT or 488 if in the next cell time it can accept anothermulticast cell. It also indicates what multicast cell priorities it canaccept.

For unicast cells, cell transmit acknowledge information is sent. Thissignals if the unicast cell transmitted in the current cell time hasmade it to its destination QRT. If the cell has been dropped in theswitch fabric, information is sent back on whether the cell was droppedinternally to the switch fabric or at the output of the switch fabric.

6.5. WAC 488 External Port Descriptions

Each port is a 6-bit interface consisting of a nibble-wide datainterface (SE_D), a start of cell signal (SE_SOC), and abackpressure/data acknowledge signal (BP_ACK).

The SE_SOC signals carry a repeating four “0s” and four “1s” pattern toguarantee transitions required by the phase aligner. The SOC on the datalines associated with an SE_SOC line is indicated by a break in thispattern. The SOC is a single “1” followed by five “0s”.

6.6. Data Cell Format

The regular cell format is shown in Table 1 and the idle cell format isshown in Table 2. The idle cell format is chosen as to make theinterface robust to both stuck-at faults, as well as bridging faults onthe data lines.

TABLE 1 Regular Cell Format Nibble Symbol Definition Comment 0Pres(1:0), MC, SP Pres = 10b Cell present. The MC ignored in the WAC-01b Cell not present (See Table 2). 188 switch fabric where the 00b Cellassumed to be not present.(failure). SWITCH_GROUP/QUEUE 11b Cell assumedto be not present.(failure). field determines if a cell is a MC =1b  Multicast Cell. multicast cell. SP Spare bit. 1 SP(1:0),Priority(1:0) SP(1:0) Spare bits. Priority for the switching Priority =11b High priority cell. fabric. 10b Medium priority cell. NOTE: The QRTshould be 01b Low priority cell. configured never to generate00b Undefined. Cell discarded by 488. priority 00b cells as they arediscarded by the 488. 2 TAG_0 Routing tag 0 or MULTICAST_GROUP_INDMULTICAST_GROUP_INDEX(15:12) EX(15) is currently not used in the 488. 3TAG_1 Routing tag 1 or MULTICAST_GROUP_INDEX(11:8) Interpretation ofTAG_3:0 depends on if the cell is a multicast cell or not. 4 TAG_2Routing tag 2 or MULTICAST_GROUP_INDEX(7:4). 5 TAG_3 Routing tag 3 orMULTICAST_GROUP_INDEX(3:0). 6 TAG_4 Routing tag 4. 7 TAG_5 Routing tag5. 8 TAG_6 Routing tag 6. 9 TAG_7 Routing tag 7. 10 OutChan_3Interpreted as OutChan(15:12) by a WAC-487A. Not used by 488 11 SP(1:0),MB, P SP(1:0) Spare bits. MB Mark bit: Cells that are present and havethis bit set are counted by the TX_MARKED_CELL and RX_MARKED_CELLcounters. P Set to odd parity by software over nibbles 11 to 1. 12OutChan_2 Interpreted as OutChan(11:8) by a WAC-487A. Not used by 488 13OutChan_1 Interpreted as OutChan(7:4) by a WAC-487A. Not used by 488 14OutChan_0 Interpreted as OutChan(3:0) by a WAC-487A. Not used by 488 15VCI_3 VCI(15:12). Not used by 488 16 VCI_2 VCI(11:8). Not used by 488 17VCI_1 VCI(7:4) Not used by 488 18 VCI_0 VCI(3:0) Not used by 488 19PTI(2:0)/CLP PTI and CLP Field from the cell. Not used by 488 20 SEQ_1Interpreted as SEQ(7:4) by a WAC-487A. Not used by 488 21 SEQ_0Interpreted as SEQ(3:0) by a WAC-487A. Not used by 488 22-117 Payload 48byte of ATM cell a payload. Not used by 488

TABLE 2 Idle Cell Format Nibble Symbol Definition Comment 0 Pres(3:0)Pres = 0100b Cell not present. 1 IDLE_0 IDLE_0 = 000b All 0. 2 IDLE_1IDLE_1 = 1000b Marching 1. Marching “1” pattern protects againstbridging faults 3 IDLE_2 IDLE_2 = 0100b Marching 1. 4 IDLE_3 IDLE_3 =0010b Marching 1. 5 IDLE_4 IDLE_4 = 0001b Marching 1. 6-117 PayloadPayload = 0000b

6.7. BP/ACK Signals and Encoding

The BP_ACK signal is used to signal Back Pressure/Cell Acknowledgment tothe previous stage. To ensure the transitions required by the phasealigner, this line carries a repeating four “0s” and four “1s” pattern.The actual information is transferred by a break in this pattern. Thebreak is identified by a bit inversion (Inversion1) on the line,followed by a mode, and two data bits, followed by a second inversion(Inversion2) of the expected bit, if the previous pattern had continued.This is followed by the last two bits. After these information bits, therepeating pattern restarts with four “0s”.

The data acknowledge signal (BP_ACK) is used to indicate if a cell atthe current cell time was successfully transmitted or not. Dataacknowledge is a single line per port that returns from a cell'sdestination in the reverse direction from that of the data flow. If thecell is being blocked by the switch, this information is eithergenerated directly by the 488; or if the cell is not being blocked bythe switch, this information is forwarded from the next switch stage.The data acknowledge signal provides the following information to theQRT:

The cell was successfully received by the QRT at the cell destination(ACK).

The cell was not accepted by the QRT at the cell destination (Does nothappen by design).

The cell was blocked by the switch at the output of the switch fabric(ACK PAYLOAD Register).

The cell was blocked internal to the switch fabric (ACK PAYLOADRegister).

The cell was detected as a parity error cell by a 488 (ACK PAYLOADRegister)

Thus, direct information is provided to the QRT on a per-cell basis andthus on a per-VC basis. The 488 behavior to support the above scenariois as follows:

If the cell was a parity errored cell, and 488 is configured to CheckParity in the CHIP MODE Register, then the Parity Ack in the ACK PAYLOADRegister is sent (Default is ONACK).

If the cell was blocked at an output of the 488, then the Ack Payload issent; or if the cell is dropped due to congestion, the ACK PAYLOADRegister is sent (Default is MNACK).

If the cell was blocked at an output of the 488 because the entire gangis disabled, then to be cleared when all ports to a QRT known to beunavailable.

If the cell was successfully routed through the 488, the return path isset up to route the data-acknowledge signal back from the next switchstage.

In the case of multicast traffic, the BP_ACK signal also serves as abackpressure signal, indicating at each cell time which prioritymulticast cells the 488 can accept on the following cell time on a givenport.

6.8. Microprocessor Interface; Multicast SRAM Interface and Clocks andTiming Signals

The 488 has a non-multiplexed, asynchronous, general-purposemicroprocessor interface (PIF) through which the internal registers canbe accessed. The external SRAM is also indirectly accessed through thisinterface. The 488 supports 128 internal multicast groups, which isexpandable up to 32K through an external SRAM.

The 488 is driven from a single clock source up to a maximum clock rateof 66 MHz. To indicate the SOC, there is one SE_SOC_IN signal per inputport. There is one SE_SOC_OUT signal per group of four outputs. Cellsmust arrive at the input ports within an 8-clock cycle window. ACELL_START is used as a reference for an internal cell start signal todetermine the 8-clock cycle window in which the SOC signal on theSE_SOC_IN lines are valid. The internal cell start signal delay from theexternal CELL_START signal is programmed in the CSTART_OFFSET Register.

6.9. Cell Timing/Latency

The data latency through each 488 depends on the distribution mode. Themaximum latency is shown in Table 3. The data acknowledge through each488 is a maximum of five clock cycles.

TABLE 3 Data Latencies Aggregate Mode Latency 1 13 clock cycles 2, 4, 8,16, 32 10 clock cycles

6.10. Distribution Algorithm

The 488 has an algorithm that allows unicast cells to take advantage ofmultiple paths in multistage switch fabrics. This algorithm is runsimultaneously by all 488s in a system. Since the position (row andcolumn) of each 488 is known (programmed in the SWITCH FABRIC ROW andSWITCH FABRIC COLUMN Registers), and they all receive a synchronizingstrobe (CELL 24 START), each 488 can determine exactly what each other488 is doing. This enables the 488s to act globally to minimize cellcongestion in the fabric.

Each 488 needs to be informed when the 8-clock cycle window occursduring which the SE_SOC_IN is valid for the input ports. Generally,since this window can move (depending on the environment in which a cardcontaining the 488s can be used), this window is made softwareprogrammable from the reference CELL_START signal by setting theCSTART_OFFSET register. The offset between the external CELL_START andthe local CELL_START signal used internally to the 488 is programmablethrough the microprocessor interface (CELL START OFFSET Register) toallow for easy system synchronization.

The switching element performs cut-through routing wherever possible andrequires the SOC be synchronized across all input ports. For greaterflexibility, the switching element allows cells starting within a windowof 8-clock pulses to be considered to be valid. The end of this 8-clockcycle window is also indicated by the local CELL_START signal.

The 488 switch latency from the local CELL_START signal to the firstnibble depends on the gang mode. The switch latency is 8 clocks from thelocal CELL_START signal for all gang modes, except for gang mode 1 inwhich case the latency is 11 clocks. A CELL_24_START signal is used as astrobe to synchronize the internal state machines of all 488s and QRTsin the system. This signal must be coincident with the CELL_START signalwhen it occurs, and should occur every 4Nth cell time. For historicreasons it is called CELL_24_START, since in previous generation devicesit had to be driven high every 24 cell times.

6.11. General Description of Phase Aligners

The phase aligners recover a clock from the data in the 488-to-488,QRT-to-488, and 488-to-QRT interfaces. The forward cell path consists of5 signals, SE_D(3:0) and SE_SOC, while the backward path consists of onesignal, BP_ACK.

In the forward cell path, the phase aligners lock to the SE_SOC INsignal that has guaranteed signal transitions. The recovered clock isthen used to sample the other signals, SE_D_IN(3:0).

In the backward path, the phase aligners lock to the BP_ACK_IN signalthat has guaranteed signal transitions.

6.12. Multicast Backpressure Control

Multipriority backpressure is issued (high, medium and low) based on thefollowing two factors: Total buffer usage and Buffer usage on anindividual port. The total buffer pool consists of 64 cell buffers thatare divided into two pools of 32 buffers. One pool of 32 buffers isdedicated to the lower 16 ports, and the other pool of 32 buffers isdedicated to the upper 16 ports. By default each pool of 32 buffers isdivided into the following three buffer categories: Buffers 0 to 23 aregeneral purpose and will accept cells of all priorities (that is, low,medium, or high); Buffers 24 to 27 will only accept medium and highpriority cells; Buffers 28 to 31 will only accept high priority cells.

Conceptually, consider all these 32 buffers arranged one above the otherwith buffer 31 on top and buffer 0 at the bottom. As multicast cells areaccepted into the 488, the cell “floats” up to the first unused buffer.Thus, as cells keep arriving, eventually the lower buffers get filledup. Between buffers 23 and 24 is a “filter” that blocks low prioritycells so no low priority cells will use any buffers above 23. Thisfilter is the “1 st Threshold” indicated in the BP CONTROL Register.Between buffers 27 and 28 is another filter that blocks medium and lowpriority cells so no medium or low priority cells will use buffers abovebuffer 27. This is the “2nd Threshold” indicated in the BP CONTROLRegister. Turning off either threshold (1st or 2nd) in the BP CONTROLRegister-disables the corresponding filter.

This filtering allows considerable flexibility in the programming ofwhat buffers can accept which priority cells:

1st ON, 2nd ON: 0-23: low, medium, high; 24-27: medium, high; 27-31:high

1st OFF,2nd ON: 0-27: low, medium, high; 28-31: high

1st ON, 2nd OFF: 0-23: low, medium, high; 24-31: medium, high

1st OFF, 2nd OFF: 0-31: low, medium, high

Input ports are allotted buffers before they send backpressure. If aninput gets allotted a restricted buffer, its backpressure will reflectthe priorities of cells the buffer can accept. If backpressure isignored and a cell of the wrong priority does end up in a restrictedbuffer the 488-will not lock-up. The cell will not be lost or discarded.It will go out correctly. Only the logic that recommends the prioritiesof the cells to be accepted is concerned about the thresholds. The logicthat does the queuing and the logic that dequeues the cell should not beconcerned with which cell is where. Hence ignoring the recommendation(as indicated by the backpressure) should be safe.

Finally, backpressure can be asserted on an input port depending on thenumber of pending cells are in the buffer pool from that port. Thisnumber is either 3 or 4, depending on the setting in the BP CONTROLRegister. This feature guards against a single port flooding the entirepool with cells.

6.13. Backwards Compatibility to the WAC-187 and WAC-188 Devices

The WAC-187/188 INPUT MODE and the WAC-187-188 OUTPUT MODE registersallow inputports, in groups of 4, to be configured to the previousswitch family. In this mode, the 488 clock rate is limited that of theprevious switch family, currently 50 MHz All cells from a WAC-187/188device are converted to multicast cells at the ingress to the 488s, andpropagated through the 488 fabric as multicast cells. All cells to aWAC-187/188 device are converted from multicast cells to the WAC-187/188format exiting from the 488.

6.14. Multilevel Reset

When the RESET pin is asserted, the 488 is in total reset. No access ispermitted to any register sand all 488-driven signals, except theRAM_CLK are static at either 0 or 1. When the “Chip Hardware Reset” bitin the CHIP MODE register is enabled, all registers can be read from andwritten to, but do not attempt to access the multicast port vectors inthe multicast RAM. The rest of the device is in full reset. When the“Chip Hardware Reset” bit in the CHIP MODE register is disabled, but the“SW Reset” bit in the CONTROL REGISTER is enabled, the processor hasfast access to the multicast RAM. This mode allows the multicast portvectors to be set up quickly at initialization. In normal deviceoperation, the processor has a single multicast RAM access every 118clocks.

7. Suecific implement of a Routing Table, the WAC-487

Aspects of the present invention are also incorporated in the WAC-487, aspecific routing table part developed by the assignee of the presentinvention. Details of this implementation are included herein in partfor the sake of completeness and should not be taken as limiting theinvention defined by the attached claims. The 487 is an advancedcommunications device capable of supporting very large, high-performanceATM switching systems. Its support of per-Virtual Channel (VC) receivequeues, 64 service classes, complex multipriority scheduling algorithms,and integrated congestion management algorithms allows systems builtwith the QRT™ to support sophisticated network service offerings.

The QRT provides 622 Mbps of input and output buffered access to switchfabrics composed of either IgT WAC-188s or IgT WAC-488s (32×32 ATM QSEs)to support architectures from 1.2 Gbps to 320 Gbps. In addition, the QRTsupports a stand-alone, purely output-buffered 800 Mbps switch mode.Per-VC receive queues, three types of per-cell switch fabric feedback,and per-VC cell selection algorithms are used to prevent head-of-lineblocking commonly associated with input buffers. It also provides eightseparate congestion thresholds, each with hysteresis, that selectivelycontrol AAL5 Early Packet Discard (EPD)/Packet Tail Discard (PTD),CLP-based cell dropping, and/or EFCI marking. Eight separate maximumthresholds are also supported. Additional highlights of the QRT includefull VPI/VCI header translation, separate input and output cell buffers(up to 64K each), Virtual Path Connection (VPC)NVirtual ChannelConnection (VCC) connections, and up to 16K VCs. The QRT provides abidirectional connection between a UTOPIA Level 2 interface and 4-nibblewide, 66 MHz switch fabric interfaces.. A significant switch speed-upfactor, up to 1.6 times the line rate, is used to support fullthroughiput for many switch fabric configurations.

The QRT is an advanced communications device supporting a wide range ofhigh-performance WARM switching systems. The QRT and the QSE enable theefficient and timely design of scalable, fault-tolerant, and linear costATM switching systems. Additionally, the QRT's support of per-VC receiequeues, 64 receive service classes, and integrated congestion managementalgorithms allows systems built with the QRT to Support sophisticatednetwork service offerings.

7.1. ORT System Overview

The QRT can be used in a stand-alone application that supports ATMswitching up to 675 Mbps. The four switch fabric interfaces are loopedback to the QRT, allowing the UTOPIA interface to be fully used. In thisapplication, the QRT operates as an output buffered switch with no inputcell buffering.

The QRT supports a backward compatibility mode that enables switchfabric connections to the WAC-188 (8×8 ATM Switch Element). Fullfunctionality of the QRT is supported in this application except forper-VC switch fabric feedback. A number of other switch application arepossible using either the QSE or earlier SE components, including a16×16 switch application (2.4 Gbps) using two QRTs, eight ATM RoutingTables (WAC-187s), and six ATM Switch Elements (WAC-188s), a basic 32×32switch application (5 Gbps) using eight QRTs and one QSE, andapplications using modules that can be used in a range of switches withonly the interconnection changing between different sizes. By locatingthe first and last stages of a 3-stage switch fabric on port cards, ATMswitches from 2.4 Gbps to 80 Gbps can be realized with only three uniquecards (port cards are to be used in pairs). As with the previousapplication example, the per-port cost for 10 Gbps, 20 Gbps, 40 Gbps, or80 Gbps systems remain roughly constant.

7.2. Switch Fabric Interface

The QRT switch fabric interface consists of four groups of signals ineach ingress and egress direction. Each group consists of aStart_Of_Cell (SE_SOC_OUT) signal, a nibble-wide data bus, and abackpressure acknowledge (BP_PACK_IN) signal. The cell start signal istransmitted at the ingress coincident with the data indicating thebeginning of a cell. SE_SOC_OUT on the ingress is common to all fourgroups. The BP_ACK_OUT signal flows from the egress through the switchfabric in the direction opposite the data, and indicates whether a cellhas successfully passed through the switch fabric. Other signalsassociated with the switch fabric interface are the switch element clock(SEL_CLK) and RX_CELL_START. To support the highest possible throughputfor various switch fabric configurations, a clock speed-up factor of 1.6is used. That is, the switch fabric is run at a rate that is effectively1.6 times faster than the line rate.

7.3. Phase Aligners

Phase aligners are used to allow for extended device separation. Thetechnique used is a clock recovery mechanism that requires only theswitch fabric to be frequency synchronous. A master clock is distributedto all devices associated with the switch fabric, and the phase of theclock at each interface is dynamically adjusted to account for skewintroduced to the signals. The phase aligner circuitry for each mterfaceresponds to the cell start and feedback signals, which contain a highnumber of transitions to insure accurate phase adjustment of the clockfor data and signal sampling.

7.4. Other Interfaces

The QRT's UTOPIA interface implements the ATM Forum standardized 16-bit,Level 2 reconfiguration, which supports up to 31 virtual outputs viafive address bits. Up to 31 PHY or AAL layer devices with 16-bit UTOPIALevel 2 functionality can be connected to this interface, providing fullduplex throughputs of 622 Mbps.

The QRT supports two Synchronous DRAM (SDRAM) interfaces providing up to64K of cell buffering in both the receive and transmit directions. Eachinterface consists of a 32-bit data bus, a 9-bit address bus, two chipselect signals, and associated control signals. The frequency of theseinterfaces is 100 MHz. Both Synchronous Graphic RAM (SGRAM) and SDRAMdevices are supported. Clocking for these two interfaces is providedthrough the device.

The QRT supports up to 16K channels through a Synchronous SRAM (SSRAM)interface. The interface consists of a 32-bit data bus, a 16-bit addressbus, and associated control signals. The frequency of this interface is100 MHz. Clocking for this interface is provided through the device.

The QRT has data structures in the AL_RAM, including VPI/VCI addresstranslation. The interface consists of a 6-bit data bus, a 17-bitaddress bus, and associated control signals. The frequency of thisinterface is 100 MHz. Clocking for this interface is

The QRT stores the head and tail pointers for the receive direction inthe ABR RAM. Each interface consists of a 17-bit multiplexedaddress/data bus and associated control signals. The frequency of thisinterface is 100 MHz.

The QRT host processor interface allows connection of a microprocessorthrough a multiplexed 32-bit address/data bus. The suggestedmicroprocessor for this interface is the Intel i960. The microprocessorhas direct access to all the QRT control registers.

7.5. SE_SOC and BP_ACK Encodings

The SE_SOC and BP_ACK signals have guaranteed transitions and specialencodings. BP_ACK Encodings” which follows. The SE_SOC_IN and SE_SOC_OUTsignals have guaranteed transitions and SOC encodings. The SE_SOCsignals carry a repeating four zero and four ones pattern to guaranteetransitions required by the phase aligner. The “Start-Of-Cell” on thedata lines associated with an SE_SOC line is indicated by a break inthis pattern. For a valid SE_SOC, the break in pattern is followed byreset of the background pattern such that it is followed by four zeroesand four ones. The first nibble (Tag 0) of the header is coincident withSE_SOC (break in pattern).

The BP_ACK_IN and BP_ACK_OUT signals have guaranteed transitions, and BPand ACK encodings. The BP_ACK signal is used to signal backpressure/cellacknowledgment to the fabric (QSE) at the egress and receivebackpressure/cell acknowledgment at the ingress from the fabric (QSE).

To ensure the transitions required by the phase aligner the BP_ACKsignal carries a repeating four zeros, four ones pattern. The actualinformation is transferred through encoded 7-bit packets that start witha break in this background pattern. The break (an inversion) on the lineis followed by a mode bit followed by two bits of coded message and asecond inversion (inverse of the first inversion). This is followed bytwo bits of code extension in the case of an acknowledgment packet(these bits are required to be “00”). In the-case of a backpressurepacket, the next bit is the backpressure bit on the low prioritymulticast cells, followed by one code extension bit. The background isreset to four zeros and four ones after transmission of each packet.

The QRT and QSE allow back-to-back acknowledgment and backpressurepackets. In the case of back-to-back acknowledgment and backpressurepackets, the receiving device may see an inverted bit (a “1”) followedby the rest of the packet instead of a reset background pattern. Onebackpressure packet and either one or zero acknowledgment packet isexpected to be received during a cell time. The receipt of multipleacknowledgment or backpressure packets is a failure condition. Table 4describes the backpressure and acknowledgment encodings.

TABLE 4 Backpressure and Acknowledgement Encodings Code Mode Data 2 Data1 Data 0 Ext 0 Description 0 1 = Backpressure 1 = Backpressure 1 =Backpressure 0 Backpressure information. on high priority on mediumpriority on low priority This signal is present each cell time,multicast cell. multicast cell. multicast cell. regardless of whether acell was transmitted or not (on that link). This signal is withheld ifany problem is detected on the input port. 1 0 0 0 0 Signals noresponse. Treated as acknowledgement. 1 0 1 0 0 Signals Mid SwitchNegative ACKnowledgement (MNACK). 1 1 0 0 0 Signals Output NegativeACKnowledgement (ONACK). 1 1 1 0 0 Signals ACKnowledgement (ACK).

Delay between the external RX_CELL_START and local CELL_START isprogrammable through the RX_CELL_START_ALIGN register. The localCELL_START impacts the start of cell dequeue to the fabric. It alsodetermines the period within a cell time during which the BP_ACK_IN(3:0)at ingress is valid. As such, the programmable CELL_START delay allowsthe flexibility to synchronize the various QRTs and QSEs that make thesystem.

7.6. ORT Cell Flow Overview

The basic flow of cells through the QRT is as follows:

1. A cell enters the QRT on the receive side from the UTOPIA interfaceand the channel number is looked up.

2. The cell is then either dropped or transferred to the receive cellbuffer DRAM and queued in the receive queue controller depending uponsix congestion management checks (both maximum and congested thresholdsfor the device, service class, and connection).

3. When an available cell time occurs, four cells are selected by thereceive side scheduler, which reads the cells from the receive cellbuffer DRAM and transmits them from the QRT into the switch fabric.

4. Once a cell is received from the switch fabric on the transmit side,it is again either dropped or transferred to the transmit cell bufferDRAM and queued in the transmit queue controller, depending upon tencongestion management checks (both maximum and congested thresholds forthe device, virtual output, service class, service class queue, andconnection).

5. When the cell is selected for transmission by the transmit sidescheduler, it is removed from the transmit cell buffer DRAM andprocessed by the transmit multicast/header mapper for correspondingheader translation and distribution.

6. The cell then is sent to the UTOPIA interface and exits the QRT onthe transmit side.:

7.7. UTOPIA Operation

Cells received from the UTOPIA interface are first processed by thereceive header mapper and then queued for transmission within thereceive queue controller. The cell waits in the receive cell buffer DRAMfor instruction from the receive queue controller to proceed to theswitch fabric interface.

The QRT interfaces directly to a UTOPIA interface device without needingan external FIFO. The receive side UTOPIA has a 4-cell internal FIFO,and the transmit side contains a 3-cell FIFO. The QRT UTOPIA interfaceis 16 bits wide and operates at frequencies up to 50 MHz. It providesthe following modes: UTOPIA Level 1 single-PRY interface; UTOPIA Level 2multi-PHY interface

7.7.1 UTOPIA Level 2 Polling

The UTOPIA interface offers three modes of polling, as per the UTOPIALevel 2 specification: standard single cell available polling,Multiplexed Status Polling (MSP) using four cell available signals, anddirect status indication using four cell available signals. Thisversatility in polling modes allows the WAC-487-A to communicate withmany different PHY devices.

7.7.2 Multiplexed Status Polling (MSP) Using Four Cell Available Signals

In MSP using four cell available signals, up to four cell availableresponses occur every two clocks. The advantage offered by the MSP modeis the improved response time for PHY service selection. With thismethod, it is possible to poll 31 devices in a single cell time. PHYdevices, however, must comply with this optional part of the UTOPIALevel 2 specification. A standard PHY device can be configured to usethis mode even though it does not support it directly. To effect this,up to eight PHY devices can be configured with the addresses 0, 4, 8,12, 16, 20, 24, and 28. When configuring the device, setting the MSPmode bit accomplishes direct status indication, since it is a subset ofthe implemented MSP method.

7.7.3 Priority Encoding

Each Virtual Output (VO) is assigned to either high or low priority. Ofthe high priority VOs, the lowest numbered VO that has indicated it canaccept a cell and for which a cell is present, is selected. If no highpriority VOs have a match, the lowest numbered VO that has indicated itcan accept a cell and for which a cell is present is selected. Highbandwidth PHYs should be assigned to high priority by settingUT_PRIORITY=1 for that VO. Further control over the service algorithmcan be implemented by assigning the highest bandwidth PHYs within apriority to the lowest numbered PHY addresses. NOTE that the UTOPIALevel 2 specification is not designed to support oversubscription due toits lack of multipriority cell presence indications. The QRT interfaceassumes this is the case and does not attempt to share bandwidth amongPHYs of the same priority.

7.7.4 Independently Configurable Interfaces

The receive and transmit sides of the UTOPIA interface are independentlyconfigurable for either single-PHY OC-12 or multi-PHY operation. TheRX_OC_(—)12C_MODE, TX_OC_(—)12C_MODE, and UTOPIA_(—)2 bits configure thedevice for such operation. This allows versatility in the types of PHYenvironments that can be supported (for example, those that containhigh-speed, single-PHY devices, or where the QRT is called to dosingle-chip multi-PHY to high-speed single-PHY muxing operations. Thisis particularly helpful when interfacing to the RCMP-800 Operations,Admninistration, and Maintenance (OAM) processor as the output of thatdevice has a single-PHY-like Saturn interface.

7.8. RT Receiver Operation

7.8.1 Receive VC (Channel) Lookup

The receive channel lookup uses two tables: a VI_VPI_and a VCI_TABLE togenerate a chanmel number for an incoming cell. The channel number inturn is used to access the Channel Control Block (CCB), in theconnection table. The CCB contains the configuration and state for theconnection. The Virtual Input (VI) number and the VPI bits are used toindex into a VI_VPI_TABLE of up to 4K entries. Each entry contains thebase address of a block in the VCI_TABLE for that VP and the size ofthat block. A VCI_TABLE entry contains a channel number for that VCC. Ifit is a VPC, the VI_VPI_TABLE contains the channel number directly.Since the VC_BASE is just a pointer to the VC table, and the VC tableholds no state information, the number of active VC bits can be modifiedduring operation by creating a new VC table and then changing theVC_BASE and VC_BITS values to point to the new table in one write. Thisallows the eventual size of the VCI block to be guessed when the firstconnection arrives without penalty if that guess proves later to be toolow. This method of determining the CCB allows a flexible and wide rangeof active VPI and VCI bits without requiring an expensiveContent-Addressable Memory (CAM) or causing fragmentation of the CCBs.

7.8.2 Receive VC (Channel) Queuing

Receive cells are enqueued on a per-VC (channel) basis. This means thatthere up to 16K queues. Singly linked lists are used to queue the cells.The head pointers, the tail pointers, and the linked lists are all inexternal RAM.

7.8.3 Receive Channel Ring

The list of channels that are eligible to send a cell to the fabric arekept in per-service class rings. The ring is kept in external memory andpointers to the previous and current channels for each service class arekept in internal memory. A channel number is entered into the ring whenthe first cell for that channel arrives. While cells for that channelare present in the queuing system, the channel can be removed from thering by the dequeue process and sometimes re-added to the ring by theprocess that updates the data structures with the results of from thelast cell time.

7.8.4 Receive Congestion Management

The receive queue controller maintains current, congested, and maximumqueue depth counts of cells on a per-VC, per-service class, andper-device basis. Three congestion management algorithms are availablefor use on a per channel basis. In each channel's RX_CH_CONFIG word arebits that enable EPD, CLP-based discard, and EFCI. These may be used incombination. In addition, PTD is supported as a mode of the EPDoperation. A congestion hysteresis bit is kept for each threshold. Thisbit is set whenever the queue depth exceeds the congestion limit forthat threshold. This bit remains asserted until the queue depth fallsbelow half of the congestion threshold. The congestion limits are keptin an exponential form. The interpretation of the limits is the same forall measurements except the device limit. For the other measurements,the value of 0 causes the measurement to always find congestion. Thevalue of 1 may not be used. The value of Fh causes congestion to befound for the limit when the queue depth is 31744. This allows a 15-bitvalue to be used to store the state of each measurement except thedevice measurement, which has a 16-bit value.

7.8.5 Receive Oueue Service Algorithm

Each switch fabric cell time, the receive queue controller selects up tofour cells for transmission to the switch fabric. The controllersupports per-channel (per-VC) queues with 64 service classes. Thecontroller addresses the following issues: Quality of Service (QoS),Cell Delay Variation (CDV) minimization, Minimum Cell Rate (MCR)guarantees, and fairness maximization. The flexibility of the controllerensures that VCs receive their expected bandwidth in a timely fashiondepending on their traffic requirements.

The controller has a scheduler which selects cells to be placed inpipelined, “Ping-Pong” buffers. Each of the four outputs to the switchfabric has two buffers: while a cell in buffer A is being transmitted,another cell is selected and placed into buffer B. On the subsequentswitch fabric cell time, the buffers are “Ping-Pongee”, and the cell inbuffer B is sent. Meanwhile, another cell is selected for buffer A. Anexception to this process is when the controller receives a negativeacknowledgment (NACK) for transmission of a cell. There are two cases:the NACK is an MNACK, indicating cell transmission failed due tocollision in the middle of the network, or else the NACK is an ONACK,indicating cell transmission failed due to collision at an output of thenetwork.

In the former case, the cell's switch fabric priority (assigned duringVC setup) is compared with that of the cell (if any) in the otherPing-Pong buffer. Call the first cell X, and the second cell Y. If thepriority of cell X is greater than or equal to that of cell Y. thebuffers are not ping-ponged, and cell X will be resent next time. If thepriority of cell X is less than that of cell Y, cell X remains in itsbuffer, and the buffers are ping-ponged as usual, with cell Y being sentnext. In the latter case, the cell is requeued at the head its VC'squeue. Thus, the cell will be retransmitted, but at a later time than ifthe cell was MNACKed. The switch fabric has been specially designed tominimize the possibility of consecutive collisions at the same place inthe middle of the network, and thus a cell's transmission that failed inthat manner stands a good probability of being successful in animmediately subsequent transmission attempt. Collisions at an output ofthe network are more likely to be recuring for a period of time, andthus the next transmission attempt is delayed.

The scheduler that places cells in the Ping-Pong buffers operates asfollows: The service classes are arranged in a tabular fashion. Aservice class is designated for either unicast or multicast traffic.

Additionally, a service class is designated as either strict prioritySC1, strict priority SC2, or general purpose (GP). Associated with eachservice class is a weight of either 1, 4, 16, or 64. This information isused by the controller to decide which service class to service.Following this decision, the selected service class' VCs are serviced ina round-robin manner. The selected VC then transmits the first cell inits queue.

The general algorithm for deciding which service class to service is asfollows (certain multicast service classes may be ineligible forselection in particular modes or operating conditions; these will bedescribed later):

1. Strict priority SC1 has primary service priority. If there is an SC1service class with a cell, it will be selected. The SC1 service classesare serviced in a weighted round-robin manner, alternating betweenunicast and multicast classes (Q₀, Q₃₂, Q₁, Q₃₃, Q₂, Q₃₄, Q₃, Q₃₅, Q₀, .. . ). The SC1 round-robin pointer will remain pointed at a serviceclass for up to w cell selections, where w is the service class' weight.If no cells are available in a service class, the round-robin pointer isadvanced. Thus, the most time-critical VCs should be placed in an SC1service class. The pointer for the SC1 service classes is separate fromthe pointer to the SC2 and GP service classes.

2. Strict priority SC2 has secondary service priority. It is treated inthe. same fashion as SC1, except it has its own independent round-robinpointer and the weighted round-robin order is: Q₄, Q₃₆, Q₅, Q₃₇, Q₆,Q₃₈, Q₇, Q₃₉, Q₄, . . .

3. If no cell exists in the strict priority classes, then the controlleraccesses the timeslot-based priority table in a round-robin manner. Eachentry of this table contains a general purpose service class number. Ifthe service class pointed to by the active entry has cells, that serviceclass is selected. The active entry is incremented to the next time sloteach time the timeslot table is accessed. The table has 127 entries andwraps around. This servicing mechanism provides the MCR guarantee on aper-service class basis. The number of times a service class is placedin the timeslot table can be used to determine its MCR.

4. If no cell exists in the strict priority classes, and no cell existsin the service class pointed to by the active entry of thetimeslot-based priority table, then the GP service classes are servicedin a weighted round-robin manner similar to the SC1 and SC2 classes (Q₈,Q₄₀, Q₉, Q₄₁, Q₁₀, Q₄₂, Q₁₁, Q₄₄, . . . , Q₃₁, Q₆₃, Q₈, . . . ). Againthis has a separate round-robin pointer than that kept for the SC1 andSC2 service classes.

Certain multicast service classes may be ineligible for selection due tothe aggregate mode, and the backpressure from the switch fabric. The QRTcan be set to multicast aggregate mode of either 1 or 4. In the formercase, each of the switch fabric outputs of the QRT are treated asdistinct outputs. Multicast connections must be specifically assigned toa service class in the corresponding column of multicast service classes(there are 32 multicast service classes, with four columns of eightclasses each), since all the cells of a multicast VC must utilize thesame output. In this mode, only one column (eight) of the multicastservice classes will be eligible for selection, the other three (24service classes) will be ineligible; Service classes 32, 36, 40, 44, 48,52, 56, and 60 correspond to port 0. Service classes 33, 37, 41, 45, 49,53, 57, and 61 correspond to port 1. In the latter case, the fouroutputs are treated as one logical output, and thus all multicastconnections may be selected for any of the four outputs. Additionalservice classes may be ineligible due to backpressure (BP) from theswitch fabric. There are three types of backpressure: high, medium andlow. High BP renders the eight SC1 and SC2 multicast service classesineligible. Medium BP renders the first eight GP service classesineligible (two rows of four). Low BP renders the last 16 GP classesineligible (four rows of four).

The receive queue controller scheduler provides the following benefits:

QoS—the strict priority scheme between SC1, SC2 and GP service classes,and the weighted round-robin algorithms allow satisfaction of QoSguarantees.

CDV minimization—the treatment of the strict priority service classesensure that cells within these service classes get timely service.

MCR guarantee—the timeslot table ensures that all service classes willreceive a minimum amount of servicing (clearly, the aggregate bandwidthgiven to the SC1 and SC2 VCs affects the remaining bandwidth to bedivided between the GP service classes).

Fairness maximization—how service classes (1, 4, 16, or 64) are weightedallows different service classes to support different bandwidthrequirements (e.g., high bandwidth service classes are assigned 64 andare serviced 64 times as often as low bandwidth service classes, whichare assigned 1).

7.8.6 Receive Sequencing Algorithm

One of the service guarantees that ATM offers is the FIFO delivery ofcells. Since the QRT can send multiple cells from a channelsimultaneously across the fabric, and not all of those cells will getthrough on the first try, the QRT must support an algorithm to make surethat the cells can be put back into order. The algorithm that itsupports is a classic window algorithm where only N cells are allowed tobe outstanding without Acknowledgment. In the WAC-487-A, N is either 1or 2. This limits the data rate of an individual connection to around155 Mb/s. The cells are sequence numbered and reordered at the far end.

This algorithm is implemented by removing the channel from the ring ofeligible channels whenever 2 cells are outstanding. This is termed asRun-Limited. It also removes it if the last cell present has been sentto the fabric. This is termed Cell-Limited. It will remain off the ringuntil the fabric transmission results for a run completing cell areknown. For N=1, every cell completes a run. For N=2, the cell with themodulo lower sequence number is the run completing cell. At that time itwill be added back onto the ring if there are more cells to send or ifthat cell was ONACKed in which case that cell can be resent. Thepointers for these cells are stored in two locations in the CCB block.When starting from no cells in the fabric, the first cell sent is alwaysin POINTERO and the second cell is always in POINTER. For multicastcells, use N=2. For unicast cells use N=2. The N=1 setting is availablefor use, but has lower utility than the N=2 setting for virtually allsituations.

7.9. Transmitter Operation

7.9.1 Transmit Queuing and Congestion Management

Transmit cells are enqueued on a per service class, per virtual outputbasis. As there are 31 virtual outputs, and 16 service classes pervirtual outputs, there are a total of 496 queues. Singly linked listsare used to queue the cells. The head and tail pointers are in internalRAM and the linked lists are in external RAM.

A cell received from the switch fabric interface is queued by thetransmit queue controller if it passes ten buffer threshold checks: bothmaximum and congested thresholds for the device, virtual output, serviceclass, queue, and channel. The cell waits in the transmit cell bufferDRAM until the transmit queue controller selects it for transmitmulticast/header mapping. The cell then exits the device through theUTOPIA interface. A congestion hysteresis bit and limits are stored asabove. Three congestion management algorithms are available for use on aper channel basis. In each channel's TX_CH_CONFIG word are bits whichenable Early Packet Discard (EPD), Cell Loss Priority (CLP) baseddiscard, and Explicit Forward Congestion Indication (EFCI). These may beused in combination. In addition, Packet Tail Discard (PmD) is supportedas a mode of the EPD operation. There is an interaction between EPD andthe resequencing algorithm, as elsewhere described.

7.9.2 Transmit Oueue Service Algorithm

The transmit queue controller supports 16 service classes for each ofits 31 virtual. As with the receive queue controller, the transmit queuecontroller addresses the following key issues: QoS, CDV minimization,MCR guarantee, fairness maximization, and output isolation.

The virtual output for which a cell is to be sent is determined first.This is done by doing a bit-wise AND of vectors of the presence of acell for a VO, and the willingness of a VO to accept a cell. Of thematching VOs, the lowest numbered VO of high priority is selected ifpossible, otherwise the lowest numbered VO is selected.

Once the VO is known, the controller has a scheduler which selects acell to be transmitted to the UTOPIA interface. The scheduler operatesas follows: The service classes are arranged in a tabular fashion. Aservice class is designated for either unicast or multicast traffic.Additionally, a service class is designated as either strict prioritySC1, strict priority SC2, or general-purpose (GP). Associated with eachservice class is a weight of either 1, 4, 16, or 64. This information isused to used by the controller to decide which service class to service.Following this decision, the selected service class' cells are servicedin a FIFO manner.

The general algorithm for deciding which service class to service issimilar to that used by the receive queue controller, and is as follows:

1. Strict priority SC1 has primary service priority. If there is an SC1service class with a cell, it will be selected. The SC1 service classesare serviced in a weighted round-robin manner, alternating betweenunicast and multicast classes (Q₀, Q₈, Q₀, . . . ). The SC1 round-robinpointer will remain pointed at a service class for up to w cellselections, where w is the service class' weight. If no cells areavailable in a service class, the round-robin pointer is advanced. Thus,the most time-critical VCs should be placed in an SC1 service class.

2. Strict priority SC2 has secondary service priority. It is treated inthe same fashion as SC1, except it has its own independent round-robinpointer, and alternates: Q₁, Q₉, Q₁, . . . .

3. If no cell exists in the strict priority classes, then the controlleraccesses the timeslot-based priority table in a round-robin manner. Eachentry of this table contains a general purpose service class number. Ifthe service class pointed to by the active entry has cells, that serviceclass is selected. The active entry is incremented to the next time sloteach time the timeslot table is accessed. The table has 127 entries andwraps around. This servicing mechanism provides the MCR guarantee on aper-service class basis. The number of times a service class is placedin the timeslot table can be used to determine its MCR.

4. If no cell exists in the strict priority classes, and no cell existsin the service class pointed to by the active entry of thetimeslot-based priority table, then the GP service classes are servicedin a weighted round-robin manner similar to the SC1 and SC2 classes (Q₂,Q₁₀, Q₃, Q₄₁, Q₁₁, . . . , Q₇, Q₁₅, Q₂, . . . ).

The transmit queue controller scheduler provides the following benefits:

QoS—the strict priority scheme between SC1, SC2, and GP service classes,and the weighted round-robin algorithms allow satisfaction of QoSguarantees.

CDV minimization—the treatment of the strict priority service classesensure that cells within these service classes get timely service.

MCR guarantee—the timeslot table ensures that all service classes willreceive a minimum amount of servicing (clearly, the aggregate bandwidthgiven to the SC1 and SC2 VCs affects the remaining bandwidth to bedivided between the GP service classes).

Fairness maximization—the weighting of the service classes (1, 4, 16, or64) allow different service classes to support different bandwidthrequirements (for example, high bandwidth service classes are assigned64 and are serviced 64 times as often as low bandwidth service classes,which are assigned 1).

Output isolation—the cells of channels destined for different virtualoutputs are kept in separate data structures. This helps isolate theeffects of congestion on one virtual output from causing congestion onanother virtual output.

7.9.3 Transmit Resequencing Algorithm

The transmit end reorders the cells according to their sequence numbers.The resequencing of one algorithm ignores the incoming sequence numberand accepts all cells as if their sequence numbers were correct. Thiscan be used for multicast cells as the WAC-488 delivers them in FIFOorder.

The resequencing of two algorithm inspects an incoming cell to see if ithas the expected sequence number, e. If it does, the cell is immediatelyprocessed. If it has sequence number e+1, then it is stored to await therun completing cell (that is, the original expected sequence number, e).If it has neither sequence renumber e, nor sequence number e+1, arecovery algorithm is started which gets the channel back in sequence.

The resequencing of two algorithm interacts with EPD. When a cell ismissing, the algorithm cannot know if the missing cell is an EOF cell ornot. It is then necessary to defer the choice of whether to send bothcells until the run completing cell is received. The choice of whetherto send or drop one or more of the cells is affected by the EOFinformation because one frame that is being dropped may end, and anotherframe which is not to be dropped may start.

7.9.4 Transmit Recovery Algorithm

No recovery algorithm is needed for resequencing of one since thesequence number is ignored. For resequencing of two, when a cell withsequence number s is received, and s is neither equal to the expectedcell number e, nor equal to e+1, the cell is dropped. The new expectedsequence number (for the next cell) is set at s+1. The next time twocells are received in ascending sequence number order, the channel willhave recovered its sequence. Using this algorithm, some legitimate cellsmay be dropped while recovering. E.g. if the next two cells arelegitimate, but are received in descending sequence number order, theywill both be dropped.

7.9.5 Transmit Multicast Cell Background Process

The transmit multicast background process traverses the linked list forthat channel and prepares a list of pointers to cells and pointers toheaders for multicast cells. This allows the dequeue process toreplicate the cell with new headers to each entry in the linked list.This is necessary because multicast cells are bound to differentdestinations and need different headers. When a multicast cell arrivesit is immediately stored to RAM. The pointer to that cell buffer as wellas the OUTCHAN for that cell are put onto one of eight input FIFOs.There is one FIFO per input multicast service class. A backgroundpointer replication process which runs at the UTOPIA rate copiespointers from the input FIFOs to the output FIFOs. It does so bytraversing the linked list for that OUTCHAN and copying the pointer tothe cell buffer to output FIFO for that service class on the propervirtual output. The background process dynamically identifies if any ofthe output FIFOs are full. If any become full, the process records whichVO full for that service class and ceases transferring cells for thatservice class. Transfers still are free to occur for other serviceclasses. Once the dequeue process serves a cell instance from thatservice class on the bottlenecked VO, the background process is free tocontinue to do replications for that service class. The backgroundprocess runs at exactly the same rate as the UTOPIA interface. Thisallows it to transmit multicast cells at full rate out of the interface,even if each multicast cell is only going to one destination on thisQRT.

7.9.6 Transmit Multicast Congestion Management

The transmit multicast can have congestion management applied to it.Three of the five congestion measurements apply. Those are the device,the service class, and the channel. The virtual output and the serviceclass queue limits do not apply to multicast cells as they do not makesense. This is because only one copy of the cell is ever kept in theDRAM, independent of how many destinations it is headed for. Thosecounts contain only the number of unicast cells present.

The QRT can be configured to either generate or not generate backpressure on an per service class basis. If no back pressure is desired,configure TX_EX_MAX_SC_QD to half of the input pointer FIFO depth forthat AL_RAM_CONFIG. This will drop all cells at a depth deeper thanthis, preventing back-pressure from reaching back into the switchfabric. The setting of this is a system level decision, preventingback-pressure prevents a failure or congestion on one card fromaffecting the performance of the fabric as a whole. On the other hand,using the backpressure allows more multicast cells to be passed withoutthe fear of dropping in the egress QRT. The high priority back-pressurebit is derived from the near-fullness of queue 8. The medium priorityback-pressure bit is derived from the near-fullness of queue 9. The lowpriority backpressure bit is derived from the OR of the near-fullness ofqueues 10-15. Early Packet Discard, CLP-based dropping, and EFCI are allvalid for multicast cells and are configured in the TX_CH_CONFIG wordusing the same bits as for multicast connections.

8. Conclusion

The invention has now been explained in accordance with specificembodiments, however many variations will be obvious to those skilled inthe art. The invention should therefore not be limited except asprovided

What is claimed is:
 1. A method for routing a plurality of cells in aswitch fabric, the switch fabric having a plurality of input and outputports, the method comprising: forming input and output routing tables;forming a list of channels adapted to supply the plurality of cells,each channel having a sequence number; assigning a sequence number toeach of the plurality of cells transmitted from the input routing tableto the output routing table; limiting to N the number of cells that theinput routing table is adapted to transmit without receivingacknowledgment from the output routing table; computing an expectedsequence number for each transmitted cell; transmitting a cell to anoutput port of the output routing table if the assigned sequence numberand the expected sequence number for the cell match; storing a cellpresent in the output routing table if the assigned sequence number ofthe cell is greater than the expected sequence number of the cell and iswithin a range defined by the expected sequence number and the expectedsequence number plus N, wherein N is an integer and computing a newexpected sequence number for a channel if the assigned sequence numberof the cell neither matches the expected sequence number for the cellnor is within the range defined by the expected sequence number and theexpected sequence number plus N.
 2. The method of claim 1 furthercomprising: not discarding the cell if the cell is stored in the outputrouting table; and discarding the cell if the cell is received by theoutput routing table and the output routing table completes a sequenceof M cells, wherein all the M cells are discarded.
 3. The method ofclaim 2 wherein both steps of not discarding and discarding areperformed in accordance with an early packet discard algorithm.